Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
531	Learning Universally Quantified Invariants of Linear Data Structures Pranav Garg1 , Christof L¨oding2 , P. Madhusudan1 , and Daniel Neider2 1 University of Illinois at Urbana-Champaign Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-08-07 05:31:08 Automata theory Models of computation Logic in computer science Formal methods Computability theory Satisfiability Modulo Theories Lookup table Deterministic finite automaton Decision problem Theoretical computer science Applied mathematics Mathematics
532	Midterm 2 a.k.a. The Final Structure of a Compiler One single-sided 8.5 × 11 cheatsheet of your own devising Add to Reading List Source URL: www.cs.columbia.edu Language: English - Date: 2002-04-30 14:12:58 C programming language Subroutines C++ Computability theory Recursion Theoretical computer science ALGOL 68 Struct International Securities Identification Number Software engineering Computer programming Computing
533	Preprint from http://www.philosophyofinformation.net This is a preprint of a paper accepted for publication in Philosophical Transactions A (Royal Society) Permission to make digital or hard copies of all or part of this Add to Reading List Source URL: www.philosophyofinformation.net Language: English - Date: 2014-03-28 12:55:44 Philosophy of mind Alan Turing Philosophy of artificial intelligence Computability theory Knowledge representation Philosophy of information Luciano Floridi Question Consciousness Cognitive science Mind Philosophy
534	Content ➜ Intro & motivation, getting started COMP 4161 NICTA Advanced Course Add to Reading List Source URL: cs4161.web.cse.unsw.edu.au Language: English - Date: 2014-11-10 04:09:39 Computability theory Lambda calculus Theoretical computer science Universal quantification First-order logic Hoare logic Mathematical logic Logic Mathematics
535	On Bounded Reachability of Programs with Set Comprehensions Margus Veanes1 and Ando Saabas2? 1 2 Add to Reading List Source URL: set.ee Language: English - Date: 2009-01-06 12:05:39 Formal methods Complexity classes Computability theory Metalogic NP-complete problems FO Model theory First-order logic P Theoretical computer science Computational complexity theory Applied mathematics
536	Fall 2003 BMI[removed]CS 426 Notes O-1 ITERATIONS, LOOPS, RECURSIONS, AND GENETIC PROGRAMMING Add to Reading List Source URL: www.genetic-programming.com Language: English - Date: 2006-11-17 21:11:51 Software engineering Recursion Computability theory Subroutines Theoretical computer science Infinite loop Iteration Money supply Computer programming Programming idioms Computing
537	Content ➜ Intro & motivation, getting started COMP 4161 NICTA Advanced Course Add to Reading List Source URL: cs4161.web.cse.unsw.edu.au Language: English - Date: 2014-11-10 04:09:39 Computer science Proof theory Models of computation Computability theory Natural deduction Simply typed lambda calculus Curry–Howard correspondence Normalisation by evaluation Theoretical computer science Mathematical logic Lambda calculus
538	WS.2011 Exercises to the Lecture FSVT Prof. Dr. Klaus Madlener Add to Reading List Source URL: www-madlener.informatik.uni-kl.de Language: English - Date: 2011-10-27 06:39:41 Computability theory Formal methods Models of computation Theory of computation Algorithm Mathematical logic Turing machine Algorithm characterizations Theoretical computer science Applied mathematics Mathematics
539	Notes from the logbook of a proof-checher’s project? Domenico Cantone1 , Eugenio G. Omodeo2 , Jacob T. Schwartz3 , Pietro Ursino1 1 3 Add to Reading List Source URL: www.multimedialibrary.com Language: English - Date: 2014-03-05 10:47:18 Function Injective function Constructible universe Computability theory Μ-recursive function Fréchet derivative Mathematics Mathematical analysis Functions and mappings
540	Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very Add to Reading List Source URL: isabelle.in.tum.de Language: English - Date: 2014-08-27 06:04:04 Recursion Computability theory Mathematical logic Programming idioms Theory of computation Fold Well-founded relation Function Pattern matching Mathematics Computer programming Computing

UPDATE